Deciding trigonality of algebraic curves
نویسندگان
چکیده
Let C be an algebraic curve of genus g ≥ 3. Let us assume that C is not hyperelliptic, so that it is isomorphic to its image by the canonical map φ : C → P. Enriques proved in [1] that φ(C) is the intersection of the quadrics that contain it, except when C is trigonal (that is, it has a g 3) or C is isomorphic to a plane quintic (g = 6). The proof was completed by Babbage [2], and later Petri proved [3] that in those two cases the ideal is generated by the quadrics and cubics that contain the canonical curve. In this context, we present an implementation in Magma of a method to decide whether a given algebraic curve is trigonal, and in the affirmative case to compute a map C 3:1 → P whose fibers cut out a g 3 . Our algorithm is part of a larger effort to determine whether a given algebraic curve admits a radical parametrization.
منابع مشابه
Deciding Trigonality of Algebraic Curves (extended Abstract) 1 Classical Results on Trigonality
Let C be an algebraic curve of genus g ≥ 3. Let us assume that C is not hyperelliptic, so that it is isomorphic to its image by the canonical map φ : C → P. Enriques proved in [1] that φ(C) is the intersection of the quadrics that contain it, except when C is trigonal (that is, it has a g 3) or C is isomorphic to a plane quintic (g = 6). The proof was completed by Babbage [2], and later Petri p...
متن کاملComputational Aspects of Curves of Genus At
This survey discusses algorithmsand explicitcalculationsfor curves of genus at least 2 and their Jacobians, mainly over number elds and nite elds. Miscellaneous examples and a list of possible future projects are given at the end. 1. Introduction An enormous number of people have performed an enormous number of computations on elliptic curves, as one can see from even a perfunctory glance at 29...
متن کاملReal Parametrization of Algebraic Curves
There are various algorithms known for deciding the parametrizability (rationality) of a plane algebraic curve, and if the curve is rational, actually computing a parametrization. Optimality criteria such as low degrees in the parametrization or low degree field extensions are met by some parametrization algorithms. In this paper we investigate real curves. Given a parametrizable plane curve ov...
متن کاملAlgebraic Geometry Over Four Rings and the Frontier to Tractability
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic set (b) the height of the zero-dimensional part of an algebraic set over C (c) the number of connected components of a semi-algebraic set We also present so...
متن کاملThreadable Curves
We define a plane curve to be threadable if it can rigidly pass through a point-hole in a line L without otherwise touching L. Threadable curves are in a sense generalizations of monotone curves. Our main result is a linear-time algorithm for deciding whether a polygonal curve is threadable, and if so, finding a sequence of rigid motions to thread it through a hole. In addition, we sketch argum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1103.4689 شماره
صفحات -
تاریخ انتشار 2011